package workspace;

public class 跳台阶 {
    //public class Solution {
        public int JumpFloor(int target) {
            //非递归版类似于斐波那契解法
            if(target == 0)
                return 0;
            if(target == 1)
                return 1;
            if(target == 2)
                return 2;
            return JumpFloor(target - 1) + JumpFloor(target - 2);
        }

    //}
}
